A Randomized Population Constructive Heuristic for the Team Orienteering Problem

نویسنده

  • Manal Zettam
چکیده

Email: [email protected] Abstract: The NP-hard (complete) team orienteering problem is a particular vehicle routing problem with the aim of maximizing the profits gained from visiting control points without exceeding a travel cost limit. The team orienteering problem has a number of applications in several fields such as athlete recruiting, technician routing and tourist trip. Therefore, solving optimally the team orienteering problem would play a major role in logistic management. In this study, a novel randomized population constructive heuristic is introduced. This heuristic constructs a diversified initial population for population-based metaheuristics. The heuristics proved its efficiency. Indeed, experiments conducted on the well-known benchmarks of the team orienteering problem show that the initial population constructed by the presented heuristic wraps the best-known solution for 131 benchmarks and good solutions for a great number of benchmarks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving multi-objective team orienteering problem with time windows using adjustment iterated local search

One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...

متن کامل

A Hybrid Heuristic for the Team Orienteering Problem

In this work, we propose a hybrid heuristic in order to solve the Team Orienteering Problem (TOP). Given a set of points (or customers), each with associated score (profit or benefit), and a team that has a fixed number of members, the problem to solve is to visit a subset of points in order to maximize the total collected score. Each member performs a tour starting at the start point, visiting...

متن کامل

Heuristics for the multi-period orienteering problem with multiple time windows

This is an addendum to the paper by Tricoire et al. on various orienteering problems [1]. We present experimental results on the orienteering problem with time windows (OPTW) and team orienteering problem with time windows (TOPTW) test instances introduced by Montemanni et al. [2].

متن کامل

A heuristic scheme for the Cooperative Team Orienteering Problem with Time Windows

The Cooperative Orienteering Problem with Time Windows (COPTW)is a class of problems with some important applications and yet has received relatively little attention. In the COPTW a certain number of team members are required to collect the associated reward from each customer simultaneously and cooperatively. This requirement to have one or more team members simultaneously available at a vert...

متن کامل

Research on the Bilateral Sweep Heuristic for Single Path’s Construction

The team orienteering problem (TOP) is the generation to the case of multi tours of the Orienteering Problem (OP). A pair of origin and destination is specified and a set of potential customers with profits are provided. A single path’s initial construction which is considered as the main procedure for feasible solution initialization for the TOP is formulated as an integer program, then the BS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCS

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2017